0.03/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.14 % Command : run_E %s %d THM 0.15/0.36 % Computer : n015.cluster.edu 0.15/0.36 % Model : x86_64 x86_64 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.15/0.36 % Memory : 8042.1875MB 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 0.15/0.36 % CPULimit : 960 0.15/0.36 % WCLimit : 120 0.15/0.36 % DateTime : Tue Aug 9 05:08:11 EDT 2022 0.15/0.36 % CPUTime : 0.22/0.50 Running higher-order on 8 cores theorem proving 0.22/0.50 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p 0.22/0.50 # Version: 3.0pre003-ho 0.22/0.51 # Preprocessing class: HSMSSMSSMLSNHSN. 0.22/0.51 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.22/0.51 # Starting new_ho_10_cnf2 with 600s (5) cores 0.22/0.51 # Starting post_as_ho3 with 120s (1) cores 0.22/0.51 # Starting post_as_ho11 with 120s (1) cores 0.22/0.51 # Starting full_lambda_8 with 120s (1) cores 0.22/0.51 # post_as_ho3 with pid 26719 completed with status 0 0.22/0.51 # Result found by post_as_ho3 0.22/0.51 # Preprocessing class: HSMSSMSSMLSNHSN. 0.22/0.51 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.22/0.51 # Starting new_ho_10_cnf2 with 600s (5) cores 0.22/0.51 # Starting post_as_ho3 with 120s (1) cores 0.22/0.51 # No SInE strategy applied 0.22/0.51 # Search class: HHHNF-FFSF00-SHSSMFNN 0.22/0.51 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.22/0.51 # Starting new_ho_10 with 65s (1) cores 0.22/0.51 # new_ho_10 with pid 26726 completed with status 0 0.22/0.51 # Result found by new_ho_10 0.22/0.51 # Preprocessing class: HSMSSMSSMLSNHSN. 0.22/0.51 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.22/0.51 # Starting new_ho_10_cnf2 with 600s (5) cores 0.22/0.51 # Starting post_as_ho3 with 120s (1) cores 0.22/0.51 # No SInE strategy applied 0.22/0.51 # Search class: HHHNF-FFSF00-SHSSMFNN 0.22/0.51 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.22/0.51 # Starting new_ho_10 with 65s (1) cores 0.22/0.51 # Preprocessing time : 0.001 s 0.22/0.51 # Presaturation interreduction done 0.22/0.51 0.22/0.51 # Proof found! 0.22/0.51 # SZS status Theorem 0.22/0.51 # SZS output start CNFRefutation 0.22/0.51 thf(decl_22, type, in: $i > ($i > $o) > $o). 0.22/0.51 thf(decl_23, type, is_a: $i > ($i > $o) > $o). 0.22/0.51 thf(decl_24, type, emptyset: $i > $o). 0.22/0.51 thf(decl_25, type, unord_pair: $i > $i > $i > $o). 0.22/0.51 thf(decl_26, type, singleton: $i > $i > $o). 0.22/0.51 thf(decl_27, type, union: ($i > $o) > ($i > $o) > $i > $o). 0.22/0.51 thf(decl_28, type, excl_union: ($i > $o) > ($i > $o) > $i > $o). 0.22/0.51 thf(decl_29, type, intersection: ($i > $o) > ($i > $o) > $i > $o). 0.22/0.51 thf(decl_30, type, setminus: ($i > $o) > ($i > $o) > $i > $o). 0.22/0.51 thf(decl_31, type, complement: ($i > $o) > $i > $o). 0.22/0.51 thf(decl_32, type, disjoint: ($i > $o) > ($i > $o) > $o). 0.22/0.51 thf(decl_33, type, subset: ($i > $o) > ($i > $o) > $o). 0.22/0.51 thf(decl_34, type, meets: ($i > $o) > ($i > $o) > $o). 0.22/0.51 thf(decl_35, type, misses: ($i > $o) > ($i > $o) > $o). 0.22/0.51 thf(decl_36, type, cartesian_product: ($i > $o) > ($i > $o) > $i > $i > $o). 0.22/0.51 thf(decl_37, type, pair_rel: $i > $i > $i > $i > $o). 0.22/0.51 thf(decl_38, type, id_rel: ($i > $o) > $i > $i > $o). 0.22/0.51 thf(decl_39, type, sub_rel: ($i > $i > $o) > ($i > $i > $o) > $o). 0.22/0.51 thf(decl_40, type, is_rel_on: ($i > $i > $o) > ($i > $o) > ($i > $o) > $o). 0.22/0.51 thf(decl_41, type, restrict_rel_domain: ($i > $i > $o) > ($i > $o) > $i > $i > $o). 0.22/0.51 thf(decl_42, type, rel_diagonal: $i > $i > $o). 0.22/0.51 thf(decl_43, type, rel_composition: ($i > $i > $o) > ($i > $i > $o) > $i > $i > $o). 0.22/0.51 thf(decl_44, type, reflexive: ($i > $i > $o) > $o). 0.22/0.51 thf(decl_45, type, irreflexive: ($i > $i > $o) > $o). 0.22/0.51 thf(decl_46, type, symmetric: ($i > $i > $o) > $o). 0.22/0.51 thf(decl_47, type, transitive: ($i > $i > $o) > $o). 0.22/0.51 thf(decl_48, type, equiv_rel: ($i > $i > $o) > $o). 0.22/0.51 thf(decl_49, type, rel_codomain: ($i > $i > $o) > $i > $o). 0.22/0.51 thf(decl_50, type, rel_domain: ($i > $i > $o) > $i > $o). 0.22/0.51 thf(decl_51, type, rel_inverse: ($i > $i > $o) > $i > $i > $o). 0.22/0.51 thf(decl_52, type, equiv_classes: ($i > $i > $o) > ($i > $o) > $o). 0.22/0.51 thf(decl_53, type, restrict_rel_codomain: ($i > $i > $o) > ($i > $o) > $i > $i > $o). 0.22/0.51 thf(decl_54, type, rel_field: ($i > $i > $o) > $i > $o). 0.22/0.51 thf(decl_55, type, well_founded: ($i > $i > $o) > $o). 0.22/0.51 thf(decl_56, type, upwards_well_founded: ($i > $i > $o) > $o). 0.22/0.51 thf(decl_57, type, epred1_0: $i > $i > $o). 0.22/0.51 thf(decl_58, type, epred2_0: $i > $o). 0.22/0.51 thf(decl_59, type, epred3_0: $i > $o). 0.22/0.51 thf(decl_60, type, esk1_0: $i). 0.22/0.51 thf(decl_61, type, esk2_0: $i). 0.22/0.51 thf(subset, axiom, ((subset)=(^[X16:$i > $o, X17:$i > $o]:(![X4:$i]:(((X16 @ X4)=>(X17 @ X4)))))), file('/export/starexec/sandbox/benchmark/Axioms/SET008^0.ax', subset)). 0.22/0.51 thf(cartesian_product, axiom, ((cartesian_product)=(^[X22:$i > $o, X23:$i > $o, X4:$i, X24:$i]:(((X22 @ X4)&(X23 @ X24))))), file('/export/starexec/sandbox/benchmark/Axioms/SET008^2.ax', cartesian_product)). 0.22/0.51 thf(sub_rel, axiom, ((sub_rel)=(^[X26:$i > $i > $o, X27:$i > $i > $o]:(![X1:$i, X3:$i]:(((X26 @ X1 @ X3)=>(X27 @ X1 @ X3)))))), file('/export/starexec/sandbox/benchmark/Axioms/SET008^2.ax', sub_rel)). 0.22/0.51 thf(rel_codomain, axiom, ((rel_codomain)=(^[X28:$i > $i > $o, X3:$i]:(?[X1:$i]:((X28 @ X1 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/SET008^2.ax', rel_codomain)). 0.22/0.51 thf(rel_domain, axiom, ((rel_domain)=(^[X28:$i > $i > $o, X1:$i]:(?[X3:$i]:((X28 @ X1 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/SET008^2.ax', rel_domain)). 0.22/0.51 thf(thm, conjecture, ![X28:$i > $i > $o, X36:$i > $o, X37:$i > $o]:(((sub_rel @ X28 @ (cartesian_product @ X36 @ X37))<=((subset @ (rel_codomain @ X28) @ X37)&(subset @ (rel_domain @ X28) @ X36)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', thm)). 0.22/0.51 thf(c_0_6, plain, ((subset)=(^[Z0:$i > $o, Z1:$i > $o]:(![X4:$i]:(((Z0 @ X4)=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[subset])). 0.22/0.51 thf(c_0_7, plain, ((cartesian_product)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i, Z3:$i]:(((Z0 @ Z2)&(Z1 @ Z3))))), inference(fof_simplification,[status(thm)],[cartesian_product])). 0.22/0.51 thf(c_0_8, plain, ((sub_rel)=(^[Z0:$i > $i > $o, Z1:$i > $i > $o]:(![X1:$i, X3:$i]:(((Z0 @ X1 @ X3)=>(Z1 @ X1 @ X3)))))), inference(fof_simplification,[status(thm)],[sub_rel])). 0.22/0.51 thf(c_0_9, plain, ((rel_codomain)=(^[Z0:$i > $i > $o, Z1:$i]:(?[X1:$i]:((Z0 @ X1 @ Z1))))), inference(fof_simplification,[status(thm)],[rel_codomain])). 0.22/0.51 thf(c_0_10, plain, ((rel_domain)=(^[Z0:$i > $i > $o, Z1:$i]:(?[X3:$i]:((Z0 @ Z1 @ X3))))), inference(fof_simplification,[status(thm)],[rel_domain])). 0.22/0.51 thf(c_0_11, negated_conjecture, ~(![X28:$i > $i > $o, X36:$i > $o, X37:$i > $o]:(((![X52:$i]:((?[X51:$i]:((X28 @ X51 @ X52))=>(X37 @ X52)))&![X54:$i]:((?[X53:$i]:((X28 @ X54 @ X53))=>(X36 @ X54))))=>![X49:$i, X50:$i]:(((X28 @ X49 @ X50)=>((X36 @ X49)&(X37 @ X50))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm]), c_0_6]), c_0_7]), c_0_8]), c_0_9]), c_0_10])])). 0.22/0.51 thf(c_0_12, negated_conjecture, ![X58:$i, X59:$i, X60:$i, X61:$i]:((((~(epred1_0 @ X59 @ X58)|(epred3_0 @ X58))&(~(epred1_0 @ X60 @ X61)|(epred2_0 @ X60)))&((epred1_0 @ esk1_0 @ esk2_0)&(~(epred2_0 @ esk1_0)|~(epred3_0 @ esk2_0))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])). 0.22/0.51 thf(c_0_13, negated_conjecture, ![X1:$i, X3:$i]:(((epred2_0 @ X1)|~((epred1_0 @ X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_12])). 0.22/0.51 thf(c_0_14, negated_conjecture, (epred1_0 @ esk1_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_12])). 0.22/0.51 thf(c_0_15, negated_conjecture, ![X1:$i, X3:$i]:(((epred3_0 @ X3)|~((epred1_0 @ X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_12])). 0.22/0.51 thf(c_0_16, negated_conjecture, (~((epred2_0 @ esk1_0))|~((epred3_0 @ esk2_0))), inference(split_conjunct,[status(thm)],[c_0_12])). 0.22/0.51 thf(c_0_17, negated_conjecture, (epred2_0 @ esk1_0), inference(spm,[status(thm)],[c_0_13, c_0_14])). 0.22/0.51 thf(c_0_18, negated_conjecture, (epred3_0 @ esk2_0), inference(spm,[status(thm)],[c_0_15, c_0_14])). 0.22/0.51 thf(c_0_19, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16, c_0_17])]), c_0_18])]), ['proof']). 0.22/0.51 # SZS output end CNFRefutation 0.22/0.51 # Parsed axioms : 71 0.22/0.51 # Removed by relevancy pruning/SinE : 0 0.22/0.51 # Initial clauses : 39 0.22/0.51 # Removed in clause preprocessing : 35 0.22/0.51 # Initial clauses in saturation : 4 0.22/0.51 # Processed clauses : 11 0.22/0.51 # ...of these trivial : 0 0.22/0.51 # ...subsumed : 0 0.22/0.51 # ...remaining for further processing : 10 0.22/0.51 # Other redundant clauses eliminated : 0 0.22/0.51 # Clauses deleted for lack of memory : 0 0.22/0.51 # Backward-subsumed : 0 0.22/0.51 # Backward-rewritten : 1 0.22/0.51 # Generated clauses : 2 0.22/0.51 # ...of the previous two non-redundant : 3 0.22/0.51 # ...aggressively subsumed : 0 0.22/0.51 # Contextual simplify-reflections : 0 0.22/0.51 # Paramodulations : 2 0.22/0.51 # Factorizations : 0 0.22/0.51 # NegExts : 0 0.22/0.51 # Equation resolutions : 0 0.22/0.51 # Propositional unsat checks : 0 0.22/0.51 # Propositional check models : 0 0.22/0.51 # Propositional check unsatisfiable : 0 0.22/0.51 # Propositional clauses : 0 0.22/0.51 # Propositional clauses after purity: 0 0.22/0.51 # Propositional unsat core size : 0 0.22/0.51 # Propositional preprocessing time : 0.000 0.22/0.51 # Propositional encoding time : 0.000 0.22/0.51 # Propositional solver time : 0.000 0.22/0.51 # Success case prop preproc time : 0.000 0.22/0.51 # Success case prop encoding time : 0.000 0.22/0.51 # Success case prop solver time : 0.000 0.22/0.51 # Current number of processed clauses : 5 0.22/0.51 # Positive orientable unit clauses : 3 0.22/0.51 # Positive unorientable unit clauses: 0 0.22/0.51 # Negative unit clauses : 0 0.22/0.51 # Non-unit-clauses : 2 0.22/0.51 # Current number of unprocessed clauses: 0 0.22/0.51 # ...number of literals in the above : 0 0.22/0.51 # Current number of archived formulas : 0 0.22/0.51 # Current number of archived clauses : 5 0.22/0.51 # Clause-clause subsumption calls (NU) : 0 0.22/0.51 # Rec. Clause-clause subsumption calls : 0 0.22/0.51 # Non-unit clause-clause subsumptions : 0 0.22/0.51 # Unit Clause-clause subsumption calls : 0 0.22/0.51 # Rewrite failures with RHS unbound : 0 0.22/0.51 # BW rewrite match attempts : 1 0.22/0.51 # BW rewrite match successes : 1 0.22/0.51 # Condensation attempts : 11 0.22/0.51 # Condensation successes : 0 0.22/0.51 # Termbank termtop insertions : 2038 0.22/0.51 0.22/0.51 # ------------------------------------------------- 0.22/0.51 # User time : 0.006 s 0.22/0.51 # System time : 0.001 s 0.22/0.51 # Total time : 0.006 s 0.22/0.51 # Maximum resident set size: 1912 pages 0.22/0.51 0.22/0.51 # ------------------------------------------------- 0.22/0.51 # User time : 0.009 s 0.22/0.51 # System time : 0.002 s 0.22/0.51 # Total time : 0.011 s 0.22/0.51 # Maximum resident set size: 1808 pages 0.22/0.51 EOF